Connection Matrices for MSOL-Definable Structural Invariants
نویسنده
چکیده
Connection matrices of graph parameters were first introduced by M. Freedman, L. Lovász and A. Schrijver (2007) to study the question which graph parameters can be represented as counting functions of weighted homomorphisms. The rows and columns of a connection matrix M(f, ) of a graph parameter f and a binary operation are indexed by all finite (labeled) graphs Gi and the entry at (Gi, Gj) is given by the value of f(Gi Gj). Connection matrices turned out to be a very powerful tool for studying graph parameters in general. B. Godlin, T. Kotek and J.A. Makowsky (2008) noticed that connection matrices can be defined for general relational structures and binary operations between them, and for general structural parameters. They proved that for structural parameters f definable in Monadic Second Order Logic, (MSOL) and binary operations compatible with MSOL, the connection matrix M(f, ) has always finite rank. In this talk we discuss several applications of this Finite Rank Theorem, and outline ideas for further research.
منابع مشابه
Hankel Matrices: From Words to Graphs
We survey recent work on the use of Hankel matrices H(f,2) for real-valued graph parameters f and a binary sum-like operation 2 on labeled graphs such as the disjoint union and various gluing operations of pairs of laeled graphs. Special cases deal with real-valued word functions. We start with graph parameters definable in Monadic Second Order Logic MSOL and show how MSOL-definability can be r...
متن کاملEfficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width
Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast, graph polynomials which are definable in MSOL on the vocabulary of hypergraphs are fixed-parameter tractable with respect to tree-width, but not necessarily with respect to clique-width. No algorithmic meta-theorem ...
متن کاملMSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs
One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle’s Theorem [8]. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. ...
متن کاملOn Counting Generalized Colorings
The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, as well as the matching polynomial, the cover polynomial and the various interlace polynomials fall into this category. In this paper we present a framework of graph polynomials based on counting functions of generalized colorin...
متن کاملGeneralized Tree Descriptions for LFG
This paper proposes a novel description format for c-structure. The explicit phrase structure rewrite rules are replaced by more general constraints in a tree description language: (weak) monadic second order logic (MSOL). Exploiting the fact that the MSOL-definable tree languages correspond to the parse trees of context-free string languages, it can be shown that the generative capacity of the...
متن کامل